Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
31	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree
32	Fluid Approximation for the Analysis of Collective Adaptive Systems Jane Hillston LFCS, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2015-05-04 03:57:31 System Stochastic Artificial intelligence Systems theory Systems engineering
33	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
34	Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:47 Mathematical optimization Computational complexity theory Theory of computation Applied mathematics Academia Evolutionary algorithms Operations research Cybernetics Multi-objective optimization Reduction Algorithm CMA-ES
35	Documenta Mathematica Band 6, 2001 ¨ hrl, Heinz Siedentop Raymond Brummelhuis, Norbert Ro Stability of the Relativistic Electron-Positron Field of Atoms in Hartree-Fock Approximation: Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2002-05-29 09:16:09 Conjectures K-theory Surgery theory BaumConnes conjecture Von Neumann algebra Mathematics Mathematical analysis
36	The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2003-12-08 11:12:51 Computational complexity theory Theory of computation Mathematics Complexity classes Computational problems Theoretical computer science Structural complexity theory Tutte polynomial NP Quantum computing Time complexity Reduction
37	Proc. Idea-Finding Symposium Frankfurt Institute for Advanced Studies–153 Idea-Finding Symposium Frankfurt Institute for Advanced Studies Add to Reading List Source URL: ftp.theochem.rub.de Language: English - Date: 2004-02-24 03:00:44 Chemistry Quantum chemistry Theoretical chemistry Computational chemistry Computational physics Molecular modelling CarParrinello molecular dynamics Molecular dynamics Density functional theory BornOppenheimer approximation HartreeFock method Path integral molecular dynamics
38	Efficient algorithms for sequence segmentation Evimaria Terzi ∗ Panayiotis Tsaparas † The error in this approximate representation is measured using some error function, e.g. the sum of squares. Different Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2006-01-26 11:38:44 Systems science Mathematics Image segmentation Dynamic programming Algorithm Systems theory Approximation algorithm Time-series segmentation Graph cuts in computer vision
39	1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2012-02-08 11:20:14 Graph theory Mathematics Operations research Mathematical optimization NP-complete problems Dynamic programming Equations Systems engineering Independent set Interval scheduling Interval graph Approximation algorithm
40	ON THE CONDITIONING OF RANDOM SUBDICTIONARIES JOEL A. TROPP Abstract. An important problem in the theory of sparse approximation is to identify wellconditioned subsets of vectors from a general dictionary. In most cases, Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2007-09-11 17:01:58 Algebra Mathematics Mathematical analysis Operator theory Linear algebra Matrix Basis Inner product space Partial differential equations Differential forms on a Riemann surface NeumannPoincar operator

UPDATE